Factorization of polynomials over a finite field and irreducibility tests - PDFSEARCH.IO - Document Search Engine

Factorization of polynomials over a finite field and irreducibility tests
Results: 117

#	Item
11	On the hardness of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:57:00 Analysis of algorithms Time complexity Polynomials NP Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Theoretical computer science Mathematics Computational complexity theory
12	UNIVERSITY OF BELGRADE FACULTY OF MATHEMATICS Samira M. Zeada Classification of Monomial Orders In Polynomial Rings and Gr¨ Add to Reading List Source URL: www.matf.bg.ac.rs Language: English - Date: 2015-01-21 05:35:37 Polynomials Euclidean algorithm Degree of a polynomial Greatest common divisor Factorization of polynomials over a finite field and irreducibility tests Greatest common divisor of two polynomials Abstract algebra Mathematics Algebra
13	A new index calculus algorithm with complexity L(1/4 + o(1)) in small characteristic Antoine Joux CryptoExperts and Universit´e de Versailles Saint-Quentin-en-Yvelines, Laboratoire PRISM, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-07-24 03:29:23 Polynomials Finite field Irreducible polynomial XTR General number field sieve Field Monic polynomial Factorization of polynomials over a finite field and irreducibility tests Cantor–Zassenhaus algorithm Abstract algebra Algebra Mathematics
14	Copyright Notice and Limitations of Use © 2007 by Laura Candler. All rights reserved. Your individual purchase entitles you to reproduce these pages as needed for your own classroom use. You may also save a backup file Add to Reading List Source URL: www.lauracandler.com Language: English - Date: 2012-03-31 16:01:07 FO Finite model theory IP Clifford algebras Coding theory Elliptic curves Geometric algebra Factorization of polynomials over a finite field and irreducibility tests Mathematics Theoretical computer science Abstract algebra
15	POLYNOMIAL INTERPOLATION AND IDENTITY TESTING FROM HIGH POWERS OVER FINITE FIELDS ´ GABOR IVANYOS, MAREK KARPINSKI, MIKLOS SANTHA, Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-02-23 03:32:48 Polynomials Field theory Polynomial interpolation Polynomial Finite field Minimal polynomial Symbol Rational function Factorization of polynomials over a finite field and irreducibility tests Abstract algebra Algebra Mathematics
16	Microsoft Word - Bruce Bauslaugh final.doc Add to Reading List Source URL: mathcentral.uregina.ca Language: English - Date: 2005-11-16 13:16:54 Semigroup theory Applied mathematics Coding theory Cryptography Factorization of polynomials over a finite field and irreducibility tests James Anderson Mathematics Polynomials Theoretical computer science
17	Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd . Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 00:53:54 Finite fields Computational geometry Matroid theory Tutte polynomial Factorization of polynomials over a finite field and irreducibility tests Mathematics Polynomials Elliptic curves
18	Direct Division in Factor Rings Christopher Wolf∗ Department of Mathematics ESAT-COSIC Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-18 15:04:16 Finite fields Polynomials Euclidean algorithm Greatest common divisor XTR Vehicle Identification Number Factorization of polynomials over a finite field and irreducibility tests Lenstra elliptic curve factorization Mathematics Number theory Algebra
19	HMC MATHEMATICS Sample Math Major for Students Studying Abroad in the Fall of Junior Year Fall Spring Add to Reading List Source URL: www.math.hmc.edu Language: English - Date: 2003-11-14 20:40:39 Mathematics education 11 Logic Mathematical logic Coding theory Finite fields Propositional calculus Factorization of polynomials over a finite field and irreducibility tests Mathematics Harvard University Math 55
20	PRIME SPECIALIZATION IN GENUS 0 BRIAN CONRAD, KEITH CONRAD, AND ROBERT GROSS Abstract. For a prime polynomial f (T ) ∈ Z[T ], a classical conjecture predicts how often f has prime values. For a finite field κ and a pr Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2006-05-31 00:00:20 Abstract algebra Finite field Bateman–Horn conjecture Degree of a continuous mapping Degree of a polynomial Resultant Factorization of polynomials over a finite field and irreducibility tests Separable extension Mathematics Algebra Polynomials

UPDATE